2-D Tucker is PPA complete
نویسندگان
چکیده
منابع مشابه
2-D Tucker is PPA complete
The 2-D Tucker search problem is shown to be PPA-hard under many-one reductions; therefore it is complete for PPA. The same holds for k-D Tucker for all k ≥ 2. This corrects a claim in the literature that the Tucker search problem is in PPAD.
متن کاملOctahedral Tucker is PPA-Complete
The Octahedral Tucker problem considers an n-dimensional hypergrid of side length two, centered at the origin, triangulated by connecting the origin to all outside vertices (applied recursively on each of the lower dimensional hypergrids passing through their origins at the corresponding reduced dimensions). Each vertex is assigned a color in ±i : i = 1, 2, ..., n computed using a polynomial si...
متن کاملConsensus Halving is PPA-Complete
We show that the computational problem CONSENSUS-HALVING is PPA-complete, the first PPA-completeness result for a problem whose definition does not involve an explicit circuit. We also show that an approximate version of this problem is polynomial-time equivalent to NECKLACE SPLITTING, which establishes PPAD-hardness for NECKLACE SPLITTING, and suggests that it is also PPA-complete.
متن کامل2D-TUCKER Is PPAD-Complete
Tucker’s lemma states that if we triangulate the unit disc centered at the origin and color the vertices with {1,−1, 2,−2} in an antipodal way (if |z| = 1, then the sum of the colors of z and −z is zero), then there must be an edge for which the sum of the colors of its endpoints is zero. But how hard is it to find such an edge? We show that if the triangulation is exponentially large and the c...
متن کاملA Sperner lemma complete for PPA
The class PPA characterizes search problems whose solution is guaranteed by the lemma that \every nite graph with an odd degree vertex has another." The smaller class PPAD is de ned similarly for directed graphs. While PPAD has several natural complete problems corresponding to classical existence theorems in topology, no such complete problems were known for PPA. Here we overcome the di culty ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2020
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2019.09.002